Ranking of Makespans in Flow Shop Problems with Fuzzy Processing Times
نویسندگان
چکیده
This paper considers a flow shop problem with imprecise processing times with the objective to minimize the makespan. The processing times are described by triangular fuzzy numbers. The issue that arises is how to rank the constructed job sequences with respect to their obtained makespans, which are fuzzy numbers. A new distance measure between fuzzy makespans is introduced which includes an optimism/pessimism indicator and a function related toλ –levels of fuzzy sets, enabling the decision maker to express his/her preference. A numerical example is given to illustrate the useful support that the new distance measure provides to the decision maker.
منابع مشابه
A Mathematical Model for a Flow Shop Scheduling Problem with Fuzzy Processing Times
This paper presents a mathematical model for a flow shop scheduling problem consisting of m machine and n jobs with fuzzy processing times that can be estimated as independent stochastic or fuzzy numbers. In the traditional flow shop scheduling problem, the typical objective is to minimize the makespan). However,, two significant criteria for each schedule in stochastic models are: expectable m...
متن کاملA Fuzzy Algorithm for the m-Machine, n-Job Flow Shop Sequencing Problem
Flow shop sequencing problem is included in NP-hard problems and a number of heuristic methods have been developed to solve it. Most of these methods are offered for the crisp processing time. However fuzzy algorithm is appropriate for the problems with fuzzy processing time. This paper presents a method in which an algorithm is used to minimize make span of flow shop with fuzzy processing time...
متن کاملA Fuzzy Algorithm for the m-Machine, n-Job Flow Shop Sequencing Problem
Flow shop sequencing problem is included in NP-hard problems and a number of heuristic methods have been developed to solve it. Most of these methods are offered for the crisp processing time. However fuzzy algorithm is appropriate for the problems with fuzzy processing time. This paper presents a method in which an algorithm is used to minimize make span of flow shop with fuzzy processing time...
متن کاملFuzzy Multi-objective Permutation Flow Shop Scheduling Problem with Fuzzy Processing Times under Learning and Aging Effects
In industries machine maintenance is used in order to avoid untimely machine fails as well as to improve production effectiveness. This research regards a permutation flow shop scheduling problem with aging and learning effects considering maintenance process. In this study, it is assumed that each machine may be subject to at most one maintenance activity during the planning horizon. The objec...
متن کاملAn Effective Hybrid Genetic Algorithm for Hybrid Flow Shops with Sequence Dependent Setup Times and Processor Blocking
Hybrid flow-shop or flexible flow shop problems have remained subject of intensive research over several years. Hybrid flow-shop problems overcome one of the limitations of the classical flow-shop model by allowing parallel processors at each stage of task processing. In many papers the assumptions are generally made that there is unlimited storage available between stages and the setup times a...
متن کامل